Offdiagonal complexity: A computationally quick complexity measure for graphs and networks
نویسندگان
چکیده
منابع مشابه
Offdiagonal Complexity: A computationally quick complexity measure for graphs and networks
A vast variety of biological, social, and economical networks shows topologies drastically differing from random graphs; yet the quantitative characterization remains unsatisfactory from a conceptual point of view. Motivated from the discussion of small scale-free networks, a biased link distribution entropy is defined, which takes an extremum for a power law distribution. This approach is exte...
متن کاملOffdiagonal complexity: A computationally quick network complexity measure. Application to protein networks and cell division
Many complex biological, social, and economical networks show topologies drastically differing from random graphs. But, what is a complex network, i.e. how can one quantify the complexity of a graph? Here the Offdiagonal Complexity (OdC), a new, and computationally cheap, measure of complexity is defined, based on the node-node link cross-distribution, whose nondiagonal elements characterize th...
متن کاملFunctional Complexity Measure for Networks
We propose a complexity measure which addresses the functional flexibility of networks. It is conjectured that the functional flexibility is reflected in the topological “diversity” of the assigned graphs, resulting from a resolution of their vertices and a rewiring of their edges under certain constraints. The application will be a classification of networks in artificial or biological systems...
متن کاملComplexity and approximation ratio of semitotal domination in graphs
A set $S subseteq V(G)$ is a semitotal dominating set of a graph $G$ if it is a dominating set of $G$ andevery vertex in $S$ is within distance 2 of another vertex of $S$. Thesemitotal domination number $gamma_{t2}(G)$ is the minimumcardinality of a semitotal dominating set of $G$.We show that the semitotal domination problem isAPX-complete for bounded-degree graphs, and the semitotal dominatio...
متن کاملA similarity measure for graphs with low computational complexity
We present and analyze an algorithm to measure the structural similarity of generalized trees, a new graph class which includes rooted trees. For this, we represent structural properties of graphs as strings and define the similarity of two graphs as optimal alignments of the corresponding property stings. We prove that the obtained graph similarity measures are so called Backward similarity me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2007
ISSN: 0378-4371
DOI: 10.1016/j.physa.2006.08.067